package com.xzz.tree;

/**
 * @author: hhz
 * @create: 2022-01-20 15:01
 * 101. 对称二叉树
 **/
public class IsSymmetric {
    public static void main(String[] args) {
        TreeNode node1 = new TreeNode(1);
        TreeNode node2 = new TreeNode(2);
        TreeNode node3 = new TreeNode(2);
        TreeNode node4 = new TreeNode(3);
        TreeNode node5 = new TreeNode(4);
        TreeNode node6 = new TreeNode(4);
        TreeNode node7 = new TreeNode(3);
        node1.left = node2;
        node1.right = node3;
        node2.left = node4;
        node2.right = node5;
        node3.left = node6;
        node3.right = node7;
        System.out.println(isSymmetric(node1));
    }
    public static boolean isSymmetric(TreeNode root) {
        return traverse(root.left,root.right);
    }
    public static boolean traverse(TreeNode left,TreeNode right) {
        if(left==null || right ==null){
            return left == right;
        }
        if(left.val!= right.val){
            return false;
        }
        return traverse(left.left,right.right) && traverse(left.right,right.left);
    }
}
